Covering graph

Results: 53



#Item
31Mathematical Communications[removed]), [removed]PL Morse theory∗ Mladen Bestvina†

Mathematical Communications[removed]), [removed]PL Morse theory∗ Mladen Bestvina†

Add to Reading List

Source URL: www.math.utah.edu

Language: English - Date: 2009-02-15 19:39:32
320 DISCRETli MATHEMATICS5[removed]North-Holland Publishing Company ACYCLIC ORIENTATIONS OF GRAPHS* Richard P. STANLEY Departmentof Mathematics,Universityof California,

0 DISCRETli MATHEMATICS5[removed]North-Holland Publishing Company ACYCLIC ORIENTATIONS OF GRAPHS* Richard P. STANLEY Departmentof Mathematics,Universityof California,

Add to Reading List

Source URL: www-math.mit.edu

Language: English - Date: 2007-08-09 20:43:14
33Ranking Systems: The PageRank Axioms Alon Altman and Moshe Tennenholtz Faculty of Industrial Engineering and Management Technion – Israel Institute of Technology Haifa[removed]Israel

Ranking Systems: The PageRank Axioms Alon Altman and Moshe Tennenholtz Faculty of Industrial Engineering and Management Technion – Israel Institute of Technology Haifa[removed]Israel

Add to Reading List

Source URL: snap.stanford.edu

Language: English - Date: 2011-11-19 02:38:13
34Network Principles for SfM: Disambiguating Repeated Structures with Local Context Kyle Wilson Noah Snavely Cornell University {klw229,snavely}@cornell.edu

Network Principles for SfM: Disambiguating Repeated Structures with Local Context Kyle Wilson Noah Snavely Cornell University {klw229,snavely}@cornell.edu

Add to Reading List

Source URL: www.cs.cornell.edu

Language: English - Date: 2013-10-19 00:14:12
35A Tight Lower Bound for k-Set Agreement Soma Chaudhuri Maurice Herlihyy  Abstract: We prove tight bounds on the time needed

A Tight Lower Bound for k-Set Agreement Soma Chaudhuri Maurice Herlihyy Abstract: We prove tight bounds on the time needed

Add to Reading List

Source URL: www.markrtuttle.com

Language: English - Date: 2007-04-26 00:00:00
36

PDF Document

Add to Reading List

Source URL: snap.stanford.edu

Language: English - Date: 2013-10-24 09:46:06
37SUBMULTIPLICATIVITY AND THE HANNA NEUMANN CONJECTURE IGOR MINEYEV Abstract. We define submultiplicativity of `2 -numbers in the category of Γ-complexes over ˆ which generalizes the statement of the Strengthened Hanna N

SUBMULTIPLICATIVITY AND THE HANNA NEUMANN CONJECTURE IGOR MINEYEV Abstract. We define submultiplicativity of `2 -numbers in the category of Γ-complexes over ˆ which generalizes the statement of the Strengthened Hanna N

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2011-10-24 00:06:12
38A Hamilton Path Heuristic with Applications to the Middle Two Levels Problem Ian Shields IBM P.O. Box[removed]Research Triangle Park, North Carolina 27709, USA

A Hamilton Path Heuristic with Applications to the Middle Two Levels Problem Ian Shields IBM P.O. Box[removed]Research Triangle Park, North Carolina 27709, USA

Add to Reading List

Source URL: www.cybershields.com

Language: English - Date: 2006-06-01 22:54:49
39Combinatorial Optimization: Packing and Covering G´erard Cornu´ejols Carnegie Mellon University July 2000

Combinatorial Optimization: Packing and Covering G´erard Cornu´ejols Carnegie Mellon University July 2000

Add to Reading List

Source URL: integer.tepper.cmu.edu

Language: English - Date: 2005-08-27 11:07:38
40THE LOOPING RATE AND SANDPILE DENSITY OF PLANAR GRAPHS arXiv:1402.4169v1 [math.PR] 17 Feb[removed]ADRIEN KASSEL and DAVID B. WILSON

THE LOOPING RATE AND SANDPILE DENSITY OF PLANAR GRAPHS arXiv:1402.4169v1 [math.PR] 17 Feb[removed]ADRIEN KASSEL and DAVID B. WILSON

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2014-02-18 20:25:20